Modeling and Scheduling of Transactional Work ows
نویسندگان
چکیده
The transactional workkows (TWF) model can be regarded as a merging point of extended transaction models and general workkow model, it emphasizes both transactional aspect and business process aspect. In this report, we present a hierarchical approach for representing transactional workkows and discuss both transactional and business process aspects that a TWF should capture. We also introduce an execution model which allows us to reason about the correctness of a TWF, and to generate and execute TWF schedules.
منابع مشابه
Speci cation and Execution of Transactional Work ows
The basic transaction model has evolved over time to incorporate more complex transaction structures and to selectively modify the atomicity and isolation properties In this chapter we discuss the application of transaction concepts to activities that involve coordinated execution of multiple tasks possibly of di erent types over di erent processing entities Such applications are referred to as...
متن کاملA Model for Transactional Work ows
In this paper we present a model for representing Transactional Workkows (TWFs) involving se-quencing, parallel, alternative, conditionals, and iteration. It allows us to reason about the correct-ness of a TWF, and to generate and execute TWF schedules.
متن کاملLogic Based Modeling and Analysis of Workkows
We propose Concurrent Transaction Logic CT R as the lan guage for specifying analyzing and scheduling of work ows We show that both local and global properties of work ows can be naturally represented as CT R formulas and reasoning can be done with the use of the proof theory and the seman tics of this logic We describe a transformation that leads to an e cient algorithm for scheduling work ows...
متن کاملLogic Based Modeling and Analysis of Workkows Extended Abstract
We propose Concurrent Transaction Logic (CT R) as the language for specifying, analyzing, and scheduling of work ows. We show that both local and global properties of work ows can be naturally represented as CT R formulas and reasoning can be done with the use of the proof theory and the semantics of this logic. We describe a transformation that leads to an e cient algorithm for scheduling work...
متن کاملTransactions in Transactional Workflows
Work ow management systems WFMSs are nding wide applica bility in small and large organizational settings Advanced transaction models ATMs focus on maintaining data consistency and have provided solutions to many problems such as correctness consistency and reliability in transaction processing and database management environments While such concepts have yet to be solved in the domain of work ...
متن کامل